Scan-based attacks on linear feedback shift register based stream ciphers
نویسندگان
چکیده
منابع مشابه
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f . Their security is usually studied in terms of correlation attacks, that can be seen as solving a system of multivariate linear equations, true with some probability. At ICISC’02 this approach is extended to systems of higher-degree multivariate equations, and gives an attack in 2 ...
متن کاملFast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relation involving the key/state bits and the output bits. Recent papers by Courtois, Meier, Krause and Armknecht [1, 2, 10, 11] show that such relations exist for several well known constructions of stream ciphers immune t...
متن کاملLinearisation Attacks on FCSR-based Stream Ciphers
This paper presents a new class of cryptanalytic attacks, which are applicable against those binary additive synchronous stream ciphers, whose analysis theory is based on the properties of 2-adic numbers. These attacks are named as ‘Linearisation Attacks’. Linearisation attacks consist of three variants, which are referred as ‘Conventional Linearisation Attacks (CLAs)’, ‘Fast Linearisation Atta...
متن کاملLinear Feedback Shift Register
A stream cipher is a symmetric cipher which operates with a time-varying transformation on individual plaintext digits. By contrast, block ciphers operate with a fixed transformation on large blocks of plaintext digits. More precisely, in a stream cipher a sequence of plaintext digits, m0m1 . . ., is encrypted into a sequence of ciphertext digits c0c1 . . . as follows: a pseudorandom sequence s...
متن کاملPrimitive polynomials for robust linear feedback shift registers-based scramblers and stream ciphers
It is well known that in order to build linear scramblers and stream ciphers that are robust against correlation-based reconstruction, primitive polynomials which do not have sparse multiples of moderate degrees must be used. In this paper, the existence and density of such ‘good primitive polynomials’ are studied. Two theoretical lower bounds on the degree d of the primitive polynomial are der...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Design Automation of Electronic Systems
سال: 2011
ISSN: 1084-4309,1557-7309
DOI: 10.1145/1929943.1929952